An Efficient Message Scheduling Algorithm for WDM Lightwave Networks
نویسندگان
چکیده
Ž . Two important issues that need to be addressed when designing medium access control MAC protocols for Wavelength Division Multiplexing networks are message sequencing and channel assignment. Channel assignment addresses the problem of choosing an appropriate data channel via which a message is transmitted. This problem has been addressed extensively in the literature. On the other hand, message sequencing, which addresses the order in which messages are sent, has rarely been addressed. In this paper, we propose a new reservation-based message scheduling algorithm called RO-EATS that addresses both the channel assignment and message sequencing during its scheduling process. We formulate an analytical model and conduct extensive simulations to evaluate the performance of this algorithm. We compare the performance results of a well-known algorithm which only addresses the channel assignment issue with those of our new algorithm. The comparison shows that our new algorithm gives significant improvement over scheduling algorithms that do not consider message sequencing. As a result, we anticipate that these research results will lead to new approaches to message scheduling on WDM networks. q 1999 Published by Elsevier Science B.V. All rights reserved. Ž .
منابع مشابه
A Receiver - Oriented Message Scheduling Algorithm for Wdm Lightwave Networks
In scheduling the transmission of messages in a WDM network, we are facing not only the channel assignment problem but also message sequencing problem In this paper, we propose and evaluate a new reservationbased message scheduling algorithm for single-hop, WDM passive star lightwave network which addresses both the assignment aspect and the sequencing aspect of the problem. We compare the perf...
متن کاملEfficient Sequencing Techniques for Variable-Length Messages in WDM Networks
Message sequencing and channel assignment are two important issues that need to be addressed when scheduling variable-length messages in a wavelength division multiplexing (WDM) network. Channel assignment addresses the problem of choosing an appropriate data channel via which a message is transmitted to a node. This problem has been addressed extensively in the literature. On the other hand, m...
متن کاملClustering-based scheduling: A new class of scheduling algorithms for single-hop lightwave networks
In wavelength division multiplexing (WDM) star networks, the construction of the transmission schedule is a key issue, which essentially affects the network performance. Up to now, classic scheduling techniques consider the nodes’ requests in a sequential service order. However, these approaches are static and do not take into account the individual traffic pattern of each node. Owing to this m...
متن کاملAn adaptive scheduling algorithm for differentiated services on WDM optical networks
One of the important issues in the design of next generation high-speed networks is to provide differentiated services to different types of applications with various time constraints. In this paper, we study the problem of providing real-time service to either hard or soft real-time messages in conjunction with a normal transmission service to variablelength messages without time constraints i...
متن کاملProbability Distribution of the Receiver Busy Time in a Multicasting Local Lightwave Network
Lightwave Network Laxman Sahasrabuddhe and Biswanath Mukherjee Department of Computer Science, University of California, Davis, CA 95616 [email protected], [email protected] Abstract Wavelength-division multiplexing (WDM) has the ability to utilize the enormous bandwidth o ered by optical networks using today's electronics. We present an approximate analytical solution for the avera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 31 شماره
صفحات -
تاریخ انتشار 1999